Contact Processes on Random Regular Graphs
نویسندگان
چکیده
We show that the contact process on a random d-regular graph initiated by a single infected vertex obeys the “cutoff phenomenon” in its supercritical phase. In particular, we prove that, when the infection rate is larger than the lower critical value of the contact process on the infinite d-regular tree, there are positive constants C, p depending on the infection rate such that for any ε > 0, when the number n of vertices is large then (a) at times t < (C − ε) logn the fraction of infected vertices is vanishingly small, but (b) at time (C+ ε) logn the fraction of infected vertices is within ε of p, with probability p.
منابع مشابه
Contact Processes on Random Regular Graphs by Steven Lalley
We show that the contact process on a random d-regular graph initiated by a single infected vertex obeys the “cutoff phenomenon” in its supercritical phase. In particular, we prove that, when the infection rate is larger than the lower critical value of the contact process on the infinite d-regular tree, there are positive constants C, p depending on the infection rate such that for any ε > 0, ...
متن کاملContact Processes on Scale - free Networks ∗
We investigate the contact process on random graphs generated from the configuration model for scale-free complex networks with the power law exponent β ∈ (2, 3]. Using the neighborhood expansion method, we show that, with positive probability, any disease with an infection rate λ > 0 can survive for exponential time in the number of the vertices of the graph. This strongly supports the view th...
متن کاملColouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular graph. The analysis includes use of the differential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-r...
متن کاملBranching random walks and contact processes on Galton-Watson trees
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...
متن کاملPhase transitions in the quadratic contact process on complex networks.
The quadratic contact process (QCP) is a natural extension of the well-studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate λ and infected individuals recover (1→0) at rate 1. In the QCP, a combination of two 1's is required to effect a 0→1 change. We extend the study of the QCP, which so far has been limited to lattices, to complex networks. We...
متن کامل